翻訳と辞書 Words near each other ・ Robinsons Place Manila ・ Robinsons Place Palawan ・ Robinsons Place Pangasinan ・ Robinsons Place Roxas ・ Robinsons Place Santiago ・ Robinsons Place Tacloban ・ Robinsons Relocation ・ Robinsons Summit Center ・ Robinsons Supermarket ・ Robinsons Town Mall Malabon ・ Robinsons, Newfoundland and Labrador ・ Robinsons-May ・ Robinsonville, Mississippi ・ Robinsonville, New Brunswick ・ Robinson–Dadson curves ・ Robinson–Foulds metric ・ Robinson–Gabriel synthesis ・ Robinson–Patman Act ・ Robinson–Schensted correspondence ・ Robinson–Schensted–Knuth correspondence ・ Robinsville, New Jersey ・ Robinswood Hill ・ Robinswood Road Metrolink station ・ Robinsón Pitalúa ・ Robinvale ・ Robinvale (disambiguation) ・ Robinvale Airport ・ Robinvale Irrigation District Section B ・ Robinvale Irrigation District Section C ・ Robinvale Irrigation District Section D Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Robinson–Foulds metric ： ウィキペディア英語版 Robinson–Foulds metric The Robinson–Foulds metric is a way to measure the distance between unrooted phylogenetic trees. It is defined as (A + B) where A is the number of partitions of data implied by the first tree but not the second tree and B is the number of partitions of data implied by the second tree but not the first tree. It is also known as the symmetric difference metric. ==Explanation== Given two unrooted trees of nodes and a set of labels (i.e., taxa) for each node (which could be empty, but only nodes with degree greater than or equal to three can be labeled by an empty set) the Robinson–Foulds metric finds the number of $\backslash alpha$ and $\backslash alpha^$ operations to convert one into the other. The number of operations defines their distance. The authors define two trees to be the same if they are isomorphic and the isomorphism preserves the labeling. The construction of the proof is based on a function called $\backslash alpha$, which contracts an edge (combining the nodes, creating a union of their sets). Conversely, $\backslash alpha^$ expands an edge (decontraction), where the set can be split in any fashion. The $\backslash alpha$ function removes all edges from $T\_1$ that are not in $T\_2$, creating $T\_1\; \backslash wedge\; T\_2$, and then $\backslash alpha^$ is used to create edges in $T\_1\; \backslash wedge\; T\_2$ to build $T\_2$. The number of operations in each of these procedures is equivalent to the number of edges in $T\_1$ that are not in $T\_2$ plus the number of edges in $T\_2$ that are not in $T\_1$. The sum of the operations is equivalent to a transformation from $T\_1$ to $T\_2$, or vice versa. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Robinson–Foulds metric」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.